Path Methods for Strong Shift Equivalence of Positive Matrices
نویسندگان
چکیده
In the early 1990’s, Kim and Roush developed path methods for establishing strong shift equivalence (SSE) of positive matrices over a dense subring U of R. This paper gives a detailed, unified and generalized presentation of these path methods. New arguments which address arbitrary dense subrings U of R are used to show that for any dense subring U of R, positive matrices over U which have just one nonzero eigenvalue and which are strong shift equivalent over U must be strong shift equivalent over U+. In addition, we show matrices on a path of positive shift equivalent real matrices are SSE over R+; positive rational matrices which are SSE over R+ must be SSE over Q+; and for any dense subring U of R, within the set of positive matrices over U which are conjugate over U to a given matrix, there are only finitely many SSE-U+ classes.
منابع مشابه
The Work of Kim and Roush in Symbolic Dynamics
Contents 1. Introduction 1 2. Decidability results 1 3. Shift and strong shift equivalence for Boolean matrices 3 4. Strong shift equivalence of positive matrices over subrings of R 4 5. Automorphisms of the shift 4 6. The nonzero spectra of nonnegative integral matrices 6 7. The classification problem for shifts of finite type 6 8. Classification of free Z p actions on mixing SFTs 7 9. Topolog...
متن کاملStrong Shift Equivalence and the Generalized Spectral Conjecture for Nonnegative Matrices
Given matrices A and B shift equivalent over a dense subring R of R, with A primitive, we show that B is strong shift equivalent over R to a primitive matrix. This result shows that the weak form of the Generalized Spectral Conjecture for primitive matrices implies the strong form. The foundation of this work is the recent result that for any ring R, the group NK1(R) of algebraic K-theory class...
متن کاملAlgebraic Shift Equivalence and Primitive Matrices
Motivated by symbolic dynamics, we study the problem, given a unital subring 5 of the reals, when is a matrix A algebraically shift equivalent over S to a primitive matrix? We conjecture that simple necessary conditions on the nonzero spectrum of A are sufficient, and establish the conjecture in many cases. If S is the integers, we give some lower bounds on sizes of realizing primitive matrices...
متن کاملOn Algebraic Shift Equivalence of Matrices over Polynomial Rings
The paper studies algebraic shift equivalence of matrices over n-variable polynomial rings over a principal ideal domain D(n ≤ 2). It is proved that in the case n = 1, every non-nilpotent matrix over D[x] is algebraically strong shift equivalent to a nonsingular matrix. In the case n = 2, an example of non-nilpotent matrix over R[x, y, z] = R[x][y, z], which can not be algebraically shift equiv...
متن کاملParikh Matrices and Strong M-Equivalence
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M -equivalence is proposed as a canonical alternative to M -equivalence to get rid of this undesirable property. Some characterization of strong M -equivalence for a restricted class of words is obtained. Finall...
متن کامل